Lattices of Theories in Languages without Equality
نویسنده
چکیده
If S is a semilattice with operators, then there is an implicational theory Q such that the congruence lattice Con(S) is isomorphic to the lattice of all implicational theories containing Q. The author and Kira Adaricheva have shown that lattices of quasi-equational theories are isomorphic to congruence lattices of semilattices with operators [1]. That is, given a quasi-equational theory Q, there is a semilattice with operators S such that the lattice QuTh(Q) of quasi-equational theories containing Q is isomorphic to Con(S). There is a partial converse: if the semilattice has a largest element 1, and under strong restrictions on the monoid of operators, then Con(S,+, 0,F) can be represented as a lattice of quasiequational theories. Any formulation of a converse will necessarily involve some restrictions, as there are semilattices with operators whose congruence lattice cannot be represented as a lattice of quasi-equational theories. In particular, one must deal with the element corresponding to the relative variety x ≈ y, which has no apparent analogue in congruence lattices of semilattices with operators. In this note, it is shown that if S is a semilattice with operators, then Con(S,+, 0,F) is isomorphic to a lattice of implicational theories in a language that may not contain equality. The proof is a modification of the previous argument [1], but not an entirely straightforward one. En route, we also investigate atomic theories, the analogue of equational theories for a language without equality. For classical logic without equality, see Church [4] or Monk [12]. More recent work includes Blok and Pigozzi [2], Czelakowski [5], and Elgueta [6]. The standard reference for quasivarieties is Viktor Gorbunov’s book [7]. The rules for deduction in implicational theories are given explicitly in section 3. Our main result, Corollary 8, of course depends on these. It does not depend on the model theory used to interpret how it applies to structures, and indeed there are options in this regard. So there are two Date: November 8, 2010. 1991 Mathematics Subject Classification. 08C15, 08B15, 03G10.
منابع مشابه
Categorical Abstract Algebraic Logic: Subdirect Representation for Classes of Structure Systems
The notion of subdirect irreducibility in the context of languages without equality, as presented by Elgueta, is extended in order to obtain subdirect representation theorems for abstract and reduced classes of structure systems. Structure systems serve as models of firstorder theories but, rather than having universal algebras as their algebraic reducts, they have algebraic systems in the sens...
متن کاملLattices of Quasi-Equational Theories as Congruence Lattices of Semilattices with Operators: Part I
We show that for every quasivariety K of relational structures there is a semilattice S with operators such that the lattice of quasiequational theories of K (the dual of the lattice of sub-quasivarieties of K) is isomorphic to Con(S,+, 0, F). As a consequence, new restrictions on the natural quasi-interior operator on lattices of quasi-equational theories are found. 1. Motivation and terminolo...
متن کاملInclusional Theories in Declarative Programming
When studying speciic deduction techniques and strategies for operational semantics of logic programming languages special emphasis was put on the equality relation, due to its interest in a variety of diierent domains. But recently special emphasis has been put on partial order relations, and speciically on inclusions, as a basis for several diierent specii-cation frameworks. It is therefore a...
متن کاملCharacterizing classes defined without Equality
In this paper we mainly deal with first-order languages without equality and introduce a weak form of equality predicate, the so-called Leibniz equality. This equality is characterized algebraically by means of a natural concept of congruence; in any structure, it turns out to be the maximum congruence of the structure. We show that first-order logic without equality has two distinct complete s...
متن کاملTowards a Cubical Type Theory without an Interval
Following the cubical set model of type theory which validates the univalence axiom, cubical type theories have been developed that interpret the identity type using an interval pretype. These theories start from a geometric view of equality. A proof of equality is encoded as a term in a context extended by the interval pretype. Our goal is to develop a cubical theory where the identity type is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 54 شماره
صفحات -
تاریخ انتشار 2013